The Bakery Algorithm: Yet Another Specification and Verification0
نویسندگان
چکیده
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving algebra can be tailored to any algorithm at its own abstraction level. As example they gave an instructive proof which uses lower and higher views to show correctness of Lamport’s bakery algorithm. We construct two evolving algebras capturing lower and higher view respectively, enabling a simple and concise proof of correctness for the bakery algorithm.
منابع مشابه
The bakery algorithm: yet another specification and verification
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving algebra can be tailored to any algorithm at its own abstraction level. As example they gave an instructive proof which uses lower and higher views to show correctness of Lamport's bakery algorithm. We construct two evolving algebras capturing lower and higher view respecti...
متن کاملTheorem Proving for Maude’s Rewriting Logic Vlad Rusu and Manuel Clavel
We present an approach based on inductive theorem proving for verifying invariance properties of systems specified in Rewriting Logic, an executable specification language implemented (among others) in the Maude tool. Since theorem proving is not directly available for rewriting logic, we define an encoding of rewriting logic into its membership equational (sub)logic. Then, inductive theorem pr...
متن کاملA New Approach to Proving the Correctness of Multiprocess
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an improved version of the bakery algorithm. It is specified and proved correct without being decomposed into indivisible, atomic operations. This allows two different implementations for a conventional, non...
متن کاملBakery Algorithms
An approach to proving higher level properties of distributed protocols is suggested here in which a proof consists of two stages: In the higher-level stage, abstract properties of system executions are assumed and their desired consequences are proved. At the lower-level stage these abstract properties are shown to hold in every execution of the protocol. The paper studies the Bakery Algorithm...
متن کاملApplication of Artificial Neural Network and Genetic Algorithm for Predicting three Important Parameters in Bakery Industries
Farinograph is the most frequently used equipment for empirical rheological measurements of dough. It’suseful to illustrate quality of flour, behavior of dough during mechanical handling and texturalcharacteristics of finished products. The percentage of water absorption and the development time of doughare the most important parameters of farinography for bakery industries during production. H...
متن کامل